TSTP Solution File: SET626^5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SET626^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 14:39:36 EDT 2023
% Result : Theorem 0.20s 0.53s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET626^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 11:41:13 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TH0
% 0.20/0.53 %------------------------------------------------------------------------------
% 0.20/0.53 % File : SET626^5 : TPTP v8.1.2. Released v4.0.0.
% 0.20/0.53 % Domain : Set Theory
% 0.20/0.53 % Problem : TPS problem BOOL-PROP-102
% 0.20/0.53 % Version : Especial.
% 0.20/0.53 % English : Trybulec's 102th Boolean property of sets
% 0.20/0.53
% 0.20/0.53 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.20/0.53 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.20/0.53 % Source : [Bro09]
% 0.20/0.53 % Names : tps_0204 [Bro09]
% 0.20/0.53 % : BOOL-PROP-102 [TPS]
% 0.20/0.53
% 0.20/0.53 % Status : Theorem
% 0.20/0.53 % Rating : 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v4.0.0
% 0.20/0.53 % Syntax : Number of formulae : 3 ( 1 unt; 2 typ; 0 def)
% 0.20/0.53 % Number of atoms : 1 ( 0 equ; 0 cnn)
% 0.20/0.53 % Maximal formula atoms : 1 ( 1 avg)
% 0.20/0.53 % Number of connectives : 9 ( 0 ~; 0 |; 3 &; 5 @)
% 0.20/0.53 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.20/0.53 % Maximal formula depth : 8 ( 8 avg)
% 0.20/0.53 % Number of types : 2 ( 1 usr)
% 0.20/0.53 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.20/0.53 % Number of symbols : 1 ( 1 usr; 0 con; 1-1 aty)
% 0.20/0.53 % Number of variables : 4 ( 0 ^; 2 !; 2 ?; 4 :)
% 0.20/0.53 % SPC : TH0_THM_NEQ_NAR
% 0.20/0.53
% 0.20/0.53 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.20/0.53 % project in the Department of Mathematical Sciences at Carnegie
% 0.20/0.53 % Mellon University. Distributed under the Creative Commons copyleft
% 0.20/0.53 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.20/0.53 % : Polymorphic definitions expanded.
% 0.20/0.53 %------------------------------------------------------------------------------
% 0.20/0.53 thf(a_type,type,
% 0.20/0.53 a: $tType ).
% 0.20/0.53
% 0.20/0.53 thf(cZ,type,
% 0.20/0.53 cZ: a > $o ).
% 0.20/0.53
% 0.20/0.53 thf(cBOOL_PROP_102_pme,conjecture,
% 0.20/0.53 ! [X: a > $o,Y: a > $o] :
% 0.20/0.53 ( ? [Xx: a] :
% 0.20/0.53 ( ( X @ Xx )
% 0.20/0.53 & ( Y @ Xx )
% 0.20/0.53 & ( cZ @ Xx ) )
% 0.20/0.53 => ? [Xx: a] :
% 0.20/0.53 ( ( X @ Xx )
% 0.20/0.53 & ( Y @ Xx ) ) ) ).
% 0.20/0.53
% 0.20/0.53 %------------------------------------------------------------------------------
% 0.20/0.53 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.DJc27m9BTx/cvc5---1.0.5_9389.p...
% 0.20/0.53 (declare-sort $$unsorted 0)
% 0.20/0.53 (declare-sort tptp.a 0)
% 0.20/0.53 (declare-fun tptp.cZ (tptp.a) Bool)
% 0.20/0.53 (assert (not (forall ((X (-> tptp.a Bool)) (Y (-> tptp.a Bool))) (=> (exists ((Xx tptp.a)) (and (@ X Xx) (@ Y Xx) (@ tptp.cZ Xx))) (exists ((Xx tptp.a)) (and (@ X Xx) (@ Y Xx)))))))
% 0.20/0.53 (set-info :filename cvc5---1.0.5_9389)
% 0.20/0.53 (check-sat-assuming ( true ))
% 0.20/0.53 ------- get file name : TPTP file name is SET626^5
% 0.20/0.53 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_9389.smt2...
% 0.20/0.53 --- Run --ho-elim --full-saturate-quant at 10...
% 0.20/0.53 % SZS status Theorem for SET626^5
% 0.20/0.53 % SZS output start Proof for SET626^5
% 0.20/0.53 (
% 0.20/0.53 (let ((_let_1 (not (forall ((X (-> tptp.a Bool)) (Y (-> tptp.a Bool))) (=> (exists ((Xx tptp.a)) (and (@ X Xx) (@ Y Xx) (@ tptp.cZ Xx))) (exists ((Xx tptp.a)) (and (@ X Xx) (@ Y Xx)))))))) (let ((_let_2 (forall ((Xx tptp.a)) (or (not (ho_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 Xx)) (not (ho_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 Xx)))))) (let ((_let_3 (ho_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_4 (not _let_3))) (let ((_let_5 (ho_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_6 (not _let_5))) (let ((_let_7 (or _let_6 _let_4))) (let ((_let_8 (not _let_2))) (let ((_let_9 (or _let_8 _let_6 _let_4 (not (ho_3 k_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))))) (let ((_let_10 (forall ((BOUND_VARIABLE_640 |u_(-> tptp.a Bool)|) (BOUND_VARIABLE_637 |u_(-> tptp.a Bool)|) (BOUND_VARIABLE_616 tptp.a)) (or (not (forall ((Xx tptp.a)) (or (not (ho_3 BOUND_VARIABLE_640 Xx)) (not (ho_3 BOUND_VARIABLE_637 Xx))))) (not (ho_3 BOUND_VARIABLE_640 BOUND_VARIABLE_616)) (not (ho_3 BOUND_VARIABLE_637 BOUND_VARIABLE_616)) (not (ho_3 k_2 BOUND_VARIABLE_616)))))) (let ((_let_11 (not _let_9))) (let ((_let_12 (forall ((u |u_(-> tptp.a Bool)|) (e Bool) (i tptp.a)) (not (forall ((v |u_(-> tptp.a Bool)|)) (not (forall ((ii tptp.a)) (= (ho_3 v ii) (ite (= i ii) e (ho_3 u ii)))))))))) (let ((_let_13 (forall ((x |u_(-> tptp.a Bool)|) (y |u_(-> tptp.a Bool)|)) (or (not (forall ((z tptp.a)) (= (ho_3 x z) (ho_3 y z)))) (= x y))))) (let ((_let_14 (not _let_10))) (let ((_let_15 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (forall ((X (-> tptp.a Bool)) (Y (-> tptp.a Bool)) (BOUND_VARIABLE_616 tptp.a)) (or (not (forall ((Xx tptp.a)) (or (not (@ X Xx)) (not (@ Y Xx))))) (not (@ X BOUND_VARIABLE_616)) (not (@ Y BOUND_VARIABLE_616)) (not (@ tptp.cZ BOUND_VARIABLE_616))))) _let_14))))))) (let ((_let_16 (or))) (let ((_let_17 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_15) :args (_let_14))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_14) _let_10))) (REFL :args (_let_11)) :args _let_16)) (AND_ELIM (MACRO_SR_PRED_TRANSFORM (AND_INTRO _let_15 (PREPROCESS :args ((and _let_13 _let_12)))) :args ((and _let_14 _let_13 _let_12))) :args (0)) :args (_let_11 true _let_10)))) (let ((_let_18 (REFL :args (_let_9)))) (let ((_let_19 (not _let_7))) (let ((_let_20 (_let_2))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_20) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_20)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_7)) :args ((or _let_6 _let_4 _let_19))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_9 1)) (CONG _let_18 (MACRO_SR_PRED_INTRO :args ((= (not _let_6) _let_5))) :args _let_16)) :args ((or _let_5 _let_9))) _let_17 :args (_let_5 true _let_9)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_9 2)) (CONG _let_18 (MACRO_SR_PRED_INTRO :args ((= (not _let_4) _let_3))) :args _let_16)) :args ((or _let_3 _let_9))) _let_17 :args (_let_3 true _let_9)) :args (_let_19 false _let_5 false _let_3)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_9 0)) (CONG _let_18 (MACRO_SR_PRED_INTRO :args ((= (not _let_8) _let_2))) :args _let_16)) :args ((or _let_2 _let_9))) _let_17 :args (_let_2 true _let_9)) :args (false true _let_7 false _let_2)) :args (_let_1 true)))))))))))))))))))))))
% 0.20/0.53 )
% 0.20/0.53 % SZS output end Proof for SET626^5
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------